منابع مشابه
Domains in H
We give various internal descriptions of the category !-Cpo of !-complete posets and !-continuous functions in the model H of Synthetic Domain Theory introduced in 8]. It follows that the !-cpos lie between the two extreme synthetic notions of domain given by repleteness and well-completeness.
متن کاملCharacterizations and constructions of h-local domains
H-local domains arise in a variety of moduleand ideal-theoretic applications. In the first half of the paper, we survey some of these applications, and collect a number of characterizations and examples of h-local domains. In the second half, we show how diverse examples of h-local Prüfer domains arise as overrings of Noetherian domains and polynomial rings in finitely many variables.
متن کاملDigital Watermarking Technology in Different Domains
Due to high speed computer networks, the use of digitally formatted data has increased many folds.The digital data can be duplicated and edited with great ease which has led to a need for effectivecopyright protection tools. Digital Watermarking is a technology of embedding watermark withintellectual property rights into images, videos, audios and other multimedia data by a certainalgorithm .Di...
متن کاملOn traces for H(curl,Ω) in Lipschitz domains
We study tangential vector fields on the boundary of a bounded Lipschitz domain Ω in R3. Our attention is focused on the definition of suitable Hilbert spaces corresponding to fractional Sobolev regularities and also on the construction of tangential differential operators on the non-smooth manifold. The theory is applied to the characterization of tangential traces for the space H(curl,Ω). Hod...
متن کاملOverlapping Schwarz methods in H(curl) on polyhedral domains
We consider domain decomposition preconditioners for the linear algebraic equations which result from finite element discretization of problems involving the bilinear form α(·, ·) + (curl ·, curl ·) defined on a polyhedral domain Ω. Here (·, ·) denotes the inner product in (L(Ω)) and α is a positive number. We use Nedelec’s curl-conforming finite elements to discretize the problem. Both additiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00221-8